The elephant random walk with gradually increasing memory

نویسندگان

چکیده

In the simple random walk steps are independent, viz., walker has no memory. contrast, in elephant (ERW), which was introduced by Schütz and Trimper (2004), next step always depends on whole path so far. Various authors have studied further properties of ERW. Gut Stadtmüller (2021b) we case when Elephant remembers only a finite part first or last steps. both cases there separation into two different regimes as classical We also posed question about what happens if she gradually increasing past. This paper will give some answers to that question. discuss related questions for ERW:s with delays.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random walk with memory

There are a large number of different modifications and variants of the usual symmetrical random walk ~RW!. Let us mention only Levy flights, biased diffusions, self-avoiding walk ~SAW for short!, etc. Let us confine ourselves to the random walks on the discrete lattices. In SAW a walking particle is choosing its trajectory in such a way that it does not step down onto the already visited site....

متن کامل

Random recursive trees and the elephant random walk.

One class of random walks with infinite memory, so-called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We use a coupling between the two models to translate results from elephant random walks to the percolation process. We calculate, besides other quantities, exact...

متن کامل

A Random Walk with Exponential Travel Times

Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...

متن کامل

The Elephant Quantum Walk

Giuseppe Di Molfetta,1, 2, ∗ Diogo O. Soares-Pinto,3 and Sílvio M. Duarte Queirós4 Aix-Marseille Université, CNRS, École Centrale de Marseille, Laboratoire d’Informatique Fondamentale, Marseille, France Departamento de Física Teórica and IFIC, Universidad de Valencia-CSIC, Dr. Moliner 50, 46100-Burjassot, Spain Instituto de Física de São Carlos, Universidade de São Paulo, CP 369, 13560-970, São...

متن کامل

a random walk with exponential travel times

consider the random walk among n places with n(n - 1)/2 transports. we attach an exponential random variable xij to each transport between places pi and pj and take these random variables mutually independent. if transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics & Probability Letters

سال: 2022

ISSN: ['1879-2103', '0167-7152']

DOI: https://doi.org/10.1016/j.spl.2022.109598